The diameter of associahedra

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Diameter of Tree Associahedra

We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be modified by local operations called rotations, which generalize rotations in binary search trees. The rotation graph of search trees on a graph G is the skeleton of a polytope called the graph associahedron of G. We cons...

متن کامل

The diameter of type D associahedra and the non-leaving-face property

Generalized associahedra were introduced by S. Fomin and A. Zelevinsky in connection to finite type cluster algebras. Following recent work of L. Pournin in types A and B, this paper focuses on geodesic properties of generalized associahedra. We prove that the graph diameter of the n-dimensional associahedron of type D is precisely 2n − 2 for all n greater than 1. Furthermore, we show that all ...

متن کامل

Signed tree associahedra

Spines T a tree on a signed ground set V = V− t V. Spine on T = directed and labeled tree S such that • the labels of the nodes of S form a partition of the signed ground set V, • at a node labeled by U = U− t U, the source label sets of the incoming arcs are subsets of distinct connected components of TrU−, and the sink label sets of the outgoing arcs are subsets of distinct connected componen...

متن کامل

Pseudograph associahedra

Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associahedra in a general context, for pseudographs with loops and multiple edges, which are also allowed to be disconnected. We then consider deformations of pseudograph associahedra as their underlying graphs are altered by ...

متن کامل

Of Graph - Associahedra

Given any finite graph G, we offer a simple realization of the graph-associahedron PG using integer coordinates.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2014

ISSN: 0001-8708

DOI: 10.1016/j.aim.2014.02.035